Topological optimization via cost penalization
نویسندگان
چکیده
منابع مشابه
Batch Bayesian Optimization via Local Penalization
The popularity of Bayesian optimization methods for efficient exploration of parameter spaces has lead to a series of papers applying Gaussian processes as surrogates in the optimization of functions. However, most proposed approaches only allow the exploration of the parameter space to occur sequentially. Often, it is desirable to simultaneously propose batches of parameter values to explore. ...
متن کاملSome topological operators via grills
In this paper, we define and study two operators $Phi^s$ and $Psi^s$ with grill. Characterization and basic properties of these operators are obtained. Also, we generalize a grill topological spaces via topology $tau^s$ induced from operators $Phi^s$ and $Psi^s$.
متن کاملSparse Gaussian Process Regression via L1 Penalization
To handle massive data, a variety of sparse Gaussian Process (GP) methods have been proposed to reduce the computational cost. Many of them essentially map the large dataset into a small set of basis points. A common approach to learn these basis points is evidence maximization. Nevertheless, evidence maximization may lead to overfitting and cause a high computational cost. In this paper, we pr...
متن کاملCost-Based Query Optimization via AI Planning
In this paper we revisit the problem of generating query plans using AI automated planning with a view to leveraging significant advances in state-of-the-art planning techniques. Our efforts focus on the specific problem of cost-based joinorder optimization for conjunctive relational queries, a critical component of production-quality query optimizers. We characterize the general query-planning...
متن کاملA Conic Duality Frank-Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization
The famous Frank–Wolfe theorem ensures attainability of the optimal value for quadratic objective functions over a (possibly unbounded) polyhedron if the feasible values are bounded. This theorem does not hold in general for conic programs where linear constraints are replaced by more general convex constraints like positive-semidefiniteness or copositivity conditions, despite the fact that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topological Methods in Nonlinear Analysis
سال: 2019
ISSN: 1230-3429
DOI: 10.12775/tmna.2019.080